A Bisecting K-Medoids clustering Algorithm Based on Cloud Model
نویسندگان
چکیده
منابع مشابه
Parallel K-Medoids++ Spatial Clustering Algorithm Based on MapReduce
Clustering analysis has received considerable attention in spatial data mining for several years. With the rapid development of the geospatial information technologies, the size of spatial information data is growing exponentially which makes clustering massive spatial data a challenging task. In order to improve the efficiency of spatial clustering for large scale data, many researchers propos...
متن کاملA K-means-like Algorithm for K-medoids Clustering
Clustering analysis is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. This paper proposes a new algorithm for K-medoids clustering which runs like the K-means algorithm and tests several methods for selecting initial medoids. The proposed algorithm calculates the distance matrix once and uses it for finding new medoids at every i...
متن کاملK-Medoids Clustering Technique using Bat Algorithm
Clustering is one of the data analysis methods that are widely used in data mining. In this method, we partitioned the data into different subset which is known as cluster. Cluster analysis is the data reduction toll for classifying a “mountain‟ of information into manageable meaningful piles. This method is vast research area in the field of data mining. In this paper, a partitioning clusterin...
متن کاملA simple and fast algorithm for k medoids clustering pdf
This paper proposes a new algorithm for K-medoids clustering which runs like the K-means algorithm and tests several methods for selecting.This paper proposes a new algorithm for K-medoids clustering which runs like the. A new Kmedoids clustering method that should be fast and efficient.
متن کاملA simple and fast algorithm for K-medoids clustering
This paper proposes a new algorithm for K-medoids clustering which runs like the K-means algorithm and tests several methods for selecting initial medoids. The proposed algorithm calculates the distance matrix once and uses it for finding new medoids at every iterative step. To evaluate the proposed algorithm, we use some real and artificial data sets and compare with the results of other algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2018
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2018.08.301